Balanced subdivision and enumeration in balanced spheres
نویسندگان
چکیده
منابع مشابه
Enumeration Of Highly Balanced Trees
Bereg and Wang defined a new class of highly balanced d-ary trees which they call k-trees; these trees have the interesting property that the internal path length and thus the Wiener index can be calculated quite easily. A k-tree is characterized by the property that all levels, except for the last k levels, are completely filled. Bereg and Wang claim that the number of k-trees is exponentially...
متن کاملEnumeration of Balanced Symmetric Functions over GF(p)
It is proved that the construction and enumeration of the number of balanced symmetric functions over GF (p) are equivalent to solving an equation system and enumerating the solutions. Furthermore, we give an lower bound on number of balanced symmetric functions over GF (p), and the lower bound provides best known results.
متن کاملBalanced Splittings of Semi-free Actions on Homotopy Spheres
n+k Let 23 be a hornotopy (n+k)-sphere and p : G)< ~E~-2] a smooth semi-free action of a finite group G on 23 with fixed-point set a manifold F n of dimension no A decomposition of 23 into two G-invariant disks will be called a splitting of the action and the induced splitting of 2] G denoted F = FI<9 F 2. We ask whether every such action has a splitting with Hi(F1) ~Hi(F2) for i> 0 (these are ...
متن کاملBalanced Cayley graphs and balanced planar graphs
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in Section 5 of this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for ...
متن کاملBalanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1987
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187885